Symbolic model checking for discrete real-time systems
نویسندگان
چکیده
منابع مشابه
Symbolic Model Checking for Real-time Systems
We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolic...
متن کاملSymbolic Model Checking of Real-Time Systems
We present a new real-time temporal logic for the specification and verification of discrete quantitative temporal properties. This logic is an extension of the well-known logic CTL. Its semantics is defined on discrete time transition systems which are in turn interpreted in an abstract manner instead of the usual stuttering interpretation. Hence, our approach directly supports abstractions of...
متن کاملCompositional and Symbolic Model-Checking of Real-Time Systems
In this paper, we present symbolic and compositional techniques to avoid state explosion problems in model-checking for networks of timed automata. The symbolic technique is based on partitioning the inherently in nite state-space of timed automata in terms of simple constraints over the clocks variables instead of into regions. This allows the partitioning to take into account the particular s...
متن کاملSymbolic Model-Checking for Real-Time Circuits and Specifications
The verification of real-time properties requires model checking techniques for quantitative temporal structures and real-time temporal logics. However, up to now, most of those problems were solved by a translation into a standard CTL model checking problem with unit-delay structures. Although usual CTL model checkers like SMV can be used then, the translation leads to large structures and CTL...
متن کاملModel Checking Real-Time Systems
This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint about some recent extensions (namely weighted timed automata and timed games).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2017
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-017-9152-x